Analysis of the discrete-time GI/Geom(n)/1/N queue
نویسندگان
چکیده
منابع مشابه
ANALYSIS OF A DISCRETE-TIME IMPATIENT CUSTOMER QUEUE WITH BERNOULLI-SCHEDULE VACATION INTERRUPTION
This paper investigates a discrete-time impatient customer queue with Bernoulli-schedule vacation interruption. The vacation times and the service times during regular busy period and during working vacation period are assumed to follow geometric distribution. We obtain the steady-state probabilities at arbitrary and outside observer's observation epochs using recursive technique. Cost analysi...
متن کاملCost Analysis of a Discrete-time Queue
Abstract—This paper considers a Geo/G/1 queue, in which the server operates a single vacation at end of each consecutive service period. After all the customers in the system are served exhaustively, the server immediately leaves for a vacation. Upon returning from the vacation, the server inspects the queue length. If there are customers waiting in the queue, the server either resumes servin...
متن کاملTime-dependent performance analysis of a discrete-time priority queue
We present the transient analysis of the system content in a two-class discrete-time M X /D/1 priority queue. In particular, we derive an expression for the generating function of the transient system contents of both classes at the beginning of slots. Performance measures are calculated from this generating function. To illustrate our approach we conclude with some examples. c © 2008 Elsevier ...
متن کاملAnalysis of a Discrete-Time Queue with Gated Priority
This paper considers a discrete-time queue with gated priority. Low priority customers arrive at the first queue at the gate in batches according to a batch Bernoulli process (BBP). When the gate opens, all low priority customers at the first queue move to the second queue at a single server. On the other hand, high priority customers directly join the second queue upon arrival. The arrival pro...
متن کاملAnalysis of a discrete-time queue with a gate
This paper considers a discrete-time queue with a gate. The system has a single server and a gate. Customers arrive to the system according to a batch Bernoulli process and wait for the next gate opening in front of the gate. When the gate opens, all the customers who are waiting at the gate move into the inside of the gate. The server serves the customers only inside the gate. The gate closes ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Mathematics with Applications
سال: 1996
ISSN: 0898-1221
DOI: 10.1016/0898-1221(95)00182-x